package com.c2b.algorithm.leetcode.base;

/**
 * <a href='https://leetcode.cn/problems/count-the-number-of-consistent-strings/'>统计一致字符串的数目(Count the Number of Consistent Strings)</a>
 * <p>给你一个由不同字符组成的字符串 allowed 和一个字符串数组 words 。如果一个字符串的每一个字符都在 allowed 中，就称这个字符串是 一致字符串 。</p>
 * <p>请你返回 words 数组中 一致字符串 的数目。</p>
 * <p>
 * <b>示例：</b>
 * <pre>
 * 示例 1：
 *      输入：allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
 *      输出：2
 *      解释：字符串 "aaab" 和 "baa" 都是一致字符串，因为它们只包含字符 'a' 和 'b' 。
 *
 * 示例 2：
 *      输入：allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
 *      输出：7
 *      解释：所有字符串都是一致的。
 *
 * 示例 3：
 *      输入：allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
 *      输出：4
 *      解释：字符串 "cc"，"acd"，"ac" 和 "d" 是一致字符串。
 * </pre>
 * </p>
 * <p>
 * <b>提示：</b>
 * <ul>
 *     <li>1 <= words.length <= 10^4</li>
 *     <li>1 <= allowed.length <= 26</li>
 *     <li>1 <= words[i].length <= 10</li>
 *     <li>allowed 中的字符 互不相同 。</li>
 *     <li>words[i] 和 allowed 只包含小写英文字母。</li>
 * </ul>
 * </p>
 *
 * @author c2b
 * @since 2024/1/18 13:55
 */
public class LC1684CountTheNumberOfConsistentStrings_S {
    static class Solution {
        public int countConsistentStrings(String allowed, String[] words) {
            int[] cnt = new int[26];
            for (char curCh : allowed.toCharArray()) {
                ++cnt[curCh - 'a'];
            }
            int res = 0;
            for (String word : words) {
                boolean flag = true;
                for (char curCh : word.toCharArray()) {
                    if (cnt[curCh - 'a'] == 0) {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    ++res;
                }
            }
            return res;
        }
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.countConsistentStrings("ab", new String[]{"ad", "bd", "aaab", "baa", "badab"}));
        System.out.println(solution.countConsistentStrings("abc", new String[]{"a","b","c","ab","ac","bc","abc"}));
        System.out.println(solution.countConsistentStrings("cad", new String[]{"cc","acd","b","ba","bac","bad","ac","d"}));
    }
}
